Initializes a list. You must not use any list before you have initialized it.
Returns a pointer to the first node of a list or NULL if the list is empty.
Returns a pointer to the last node of a list or NULL if the list is empty.
Returns a pointer to the next node of a list or NULL if there is none.
Returns a pointer to the previous node of a list or NULL if there is none.
Iterates through a list. A block of code must follow this macro. The block doesn't get executed if the list is empty. When the list terminates node doesn't contain NULL but node->ln_Succ will be NULL. You cannot use this macro if you want to delete the nodes in the list (ie. you must not call Remove() inside the block of code following the macro).
/* Iterate through a list with complete nodes and print their names */ t = 1; ForeachNode(list,node) { if (node->ln_Name) { printf ("Node %d: %s\n", t++, node->ln_Name); if (!strcmp (node->ln_Name, "end")) break; } } if (node->ln_Succ) printf ("Not all nodes have been processed\n"); else printf ("The list doesn't contain a node with the name \"end\"\n");
Contains the name of the Intuition library. You should use this in OpenLibrary(), for example, to avoid typos.
#define ENABLE_RT 1If you replace the 1 by 0, then RT will be silently disabled.
A good example about how to use RT and what it can do can be found in AROS/workbench/demos/rtdemo.c( Output of rtdemo).
The following resources are tracked:
If you have comments or suggestions, email me at digulla@aros.fh-konstanz.de. 13. Aug 1997